Self-stabilizing K-out-of-L exclusion on tree network

In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.